The nested universal relation data model

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Nested Universal Relation Database Model

Change your habit to hang or waste the time to only chat with your friends. It is done by your everyday, don't you feel bored? Now, we will show you the new habit that, actually it's a very old habit to do that can make your life more qualified. When feeling bored of always chatting with your friends all free time, you can find the book enPDF the nested universal relation database model and the...

متن کامل

A Nested Relation Implementation for Semistructured Data

A simple implementation of nested relations also supports recursively nested trees of indefinite depth, directed acyclic graphs for sharing common subexpressions, cyclic graphs for links and cross-references, and union types for attributes. This can all be built without going beyond the capabilities of an algebra of flat relations which includes relational recursion. Its advantage is to offer s...

متن کامل

a study on insurer solvency by panel data model: the case of iranian insurance market

the aim of this thesis is an approach for assessing insurer’s solvency for iranian insurance companies. we use of economic data with both time series and cross-sectional variation, thus by using the panel data model will survey the insurer solvency.

Composition of the Universal Relation

We prove that the communication complexity of the k-fold composition of the universal relation on n bits is (1 o(1))kn when k = o( p n= logn). Warning: Essentially this paper has been published in Advances in Computational Complexity Theory and is hence subject to copyright restrictions. It is for personal use only.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Computer and System Sciences

سال: 1994

ISSN: 0022-0000

DOI: 10.1016/s0022-0000(05)80076-5